Transforming data tables into multi-dimensional projections with aggregations

ABSTRACT

A data table transformer includes a data receiving module configured to receive a set of rows, each row with a set of attributes, as input data. The data receiving module is also configured to receive locations for at least some of the attributes as zero-based edges. Layers of the edge are presented from the slowest to the fastest varying layers. The data receiving module is further configured to receive a designation of data values that appear at intersections of edge attributes from the same row. The data table transformer is also configured to walk input data by row and for each edge attribute, to distribute the value of the edge attribute to an edge tree created for each zero-based edge location. The data table transformer is further configured to display the data with a multi-dimensional, crosstabular display.

This nonprovisional application claims the benefit of U.S. ProvisionalApplication No.61/256,418, filed Oct.30, 2009, the disclosure of whichis hereby incorporated by reference.

FIELD

One embodiment is directed generally to computer systems, and inparticular to data display and aggregation in a computer system.

BACKGROUND

Relational data may be displayed in tables as a set of rows and columns.For instance, the columns “Sales” and “Units” may have row values for aseries of months. Calculations such as aggregates may be performed by adatabase application and presented by a software application with aGraphical User Interface (“GUI”).

SUMMARY

In some embodiments, a data table transformer includes a data receivingmodule configured to receive a set of rows, each row with a set ofattributes, as input data. The data receiving module is also configuredto receive locations for at least some of the attributes as zero-basededges. Layers of the edge are presented from the slowest to the fastestvarying layers. The data receiving module is further configured toreceive a designation of data values that appear at intersections ofedge attributes from the same row. The data table transformer is alsoconfigured to walk input data by row and for each edge attribute, and todistribute the value of the edge attribute to an edge tree created foreach zero-based edge location. The data table transformer is furtherconfigured to display the data with a multi-dimensional, cross-tabulardisplay.

BRIEF DESCRIPTION OF THE DRAWINGS

In order that the embodiments of the invention will be readilyunderstood, a more particular description of the invention brieflydescribed above will be rendered by reference to specific embodimentsthat are illustrated in the appended drawings. While it should beunderstood that these drawings illustrate only typical embodiments ofthe invention and are not therefore to be considered to be limiting ofits scope, the invention will be described and explained with additionalspecificity and detail through the use of the accompanying drawings, inwhich:

FIG. 1 is a block diagram illustrating a computer having a data tabletransformer that can implement an embodiment of the present invention.

FIG. 2 is a screenshot of a GUI displaying a pivot table according to anembodiment of the present invention.

FIG. 3 is a screenshot of comma separated value (“CSV”) file dataaccording to an embodiment of the present invention.

FIG. 4 is a flow diagram illustrating a process flow for performing datatable transformation according to an embodiment of the presentinvention.

DETAILED DESCRIPTION

In some embodiments, a data table transformer may prepare table data tobe presented in a multi-dimensional, or cross-tabular, format.“Cross-tabular” means that the joint distribution of two or moreattributes is displayed. A data receiving module of the data tabletransformer receives a set of rows, where each row has a set ofattributes, as input data. The data receiving module is also configuredto receive locations for at least some of the attributes as zero-basededges, where layers of the edges are presented from the slowest to thefastest varying layers. The data receiving module is further configuredto receive a designation of data values that appear at intersections ofedge attributes from the same row. The data table transformer is alsoconfigured to walk input data by row and for each edge attribute, and todistribute the value of the edge attribute to an edge tree created foreach zero-based edge location. The data is then displayed by the datatable transformer or a consuming application with a multi-dimensional,cross-tabular display. Rows and columns of data in this format may have“layers” that can be expanded and collapsed, based on the GUI, to “drilldown” to view more detailed layers. Such an implementation may allow auser application, rather than a server-side or database application, tochoose which data to present and how the data should be presented to theuser.

FIG. 1 is a block diagram of a computer 100 that can implement anembodiment of the present invention. Computer 100 includes a bus 105 orother communication mechanism for communicating information, and aprocessor 110 coupled to bus 105 for processing information. Processor110 may be any type of general or specific purpose processor, includinga central processing unit (“CPU”) or application specific integratedcircuit (“ASIC”). Computer 100 further includes a memory 115 for storinginformation and instructions to be executed by processor 110. Memory 115can be comprised of any combination of random access memory (“RAM”),read only memory (“ROM”), flash memory, cache, static storage such as amagnetic or optical disk, or any other types of computer readable mediaor combination thereof. Additionally, computer 100 includes acommunication device 120, such as a network interface card, to provideaccess to a network. Therefore, a user may interface with computer 100directly, or remotely through a network or any other method.

Computer readable media may be any available media that can be accessedby processor 110 and includes both volatile and nonvolatile media,removable and non-removable media, and communication media.Communication media may include computer readable instructions, datastructures, program modules or other data in a modulated data signalsuch as a carrier wave or other transport mechanism and includes anyinformation delivery media.

Processor 110 is further coupled via bus 105 to a display 125, such as aLiquid Crystal Display (“LCD”), for displaying information to a user,such as status information. A keyboard 130 and a cursor control device135, such as a computer mouse, is further coupled to bus 105 to enable auser to interface with computer 100.

In one embodiment, memory 115 stores software modules that providefunctionality when executed by processor 110. The modules include anoperating system 140 that provides operating system functionality forcomputer 100. The modules further include a data table transformer 145that is configured to facilitate debugging. Computer 100 can be part ofa larger system such as a cluster computing system, a distributedcomputing system, a cloud computing system, a “server farm” or any othersystem having multiple servers and/or computing devices. Computer 100will typically include one or more additional functional modules 150 toinclude additional functionality. In some embodiments, data tabletransformer 145 may be part of operating system 140 or part of one ormore other functional modules included in other functional modules 150,such as a consuming application that graphically displays table data.

It should be noted that many of the functional features described inthis specification have been presented as modules in order to moreparticularly emphasize their implementation independence. For example, amodule may be implemented as a hardware circuit comprising custom verylarge scale integration (“VLSI”) circuits or gate arrays, off-the-shelfsemiconductors such as logic chips, transistors, or other discretecomponents. A module may also be implemented in programmable hardwaredevices such as field programmable gate arrays, programmable arraylogic, programmable logic devices or the like.

Modules may also be at least partially implemented in software forexecution by various types of processors. An identified unit ofexecutable code in a software module may, for instance, comprise one ormore physical or logical blocks of computer instructions which may, forinstance, be organized as an object, procedure or function.Nevertheless, the executables of an identified module need not bephysically located together, but may comprise disparate instructionsstored in different locations that, when joined logically together,comprise the module and achieve the stated purpose for the module.Modules may be stored on a computer-readable medium, which may be, forinstance, a hard disk drive, a flash device, random access memory(“RAM”), a tape drive, an optical drive, a compact disk having read-onlymemory (“CD-ROM”) or a digital video disk having read-only memory(“DVD-ROM”), or any other such medium used to store data. The medium maybe read-only or read/write.

Indeed, a unit of executable code could be a single instruction, or manyinstructions, and may even be distributed over several different codesegments, among different programs, and across several memory devices.Similarly, operational data may be identified and illustrated hereinwithin modules, and may be embodied in any suitable form and organizedwithin any suitable type of data structure. The operational data may becollected as a single data set, or may be distributed over differentlocations including over different storage devices, and may exist, atleast partially, merely as electronic signals on a system or network.

FIG. 2 is a screenshot 200 of a GUI displaying an Oracle ApplicationDevelopment Framework (“ADF”) pivot table according to an embodiment ofthe present invention. The ADF pivot table displays a grid ofmulti-dimensional data with rows and columns and optionally, a pivotfilter bar to filter data not displayed in the rows and columns (in thiscase, filtering between “direct” and “indirect” sales data). The datamay be provided by a relational database, for example, and the data caninclude aggregations across an entire relational data set or acrossgroups of like attributes in the relational data set. In one embodiment,the ADF pivot table is developed using Oracle JDeveloper.

As an example of a relational data set, the first input may be asfollows in Table 1 below:

TABLE 1 Attr1 Attr2 Attr3 Val1 Val2 B X M 3 4 A Y M 5 6 A X M 1 2 B Y M7 8

The second input may include locations and roles for the relational dataset's attributes and may be as follows:

(1) Make Attr2 and Attr1 available on a “down”, or “row”, axis;

(2) Make Attr3 and data values available on an “across”, or “column”,axis;

(3) Data values are Val1, Val2; and

(4) Show aggregations of Val1 and Val2 for each Attr2.

The desired result, which may be made available through an ApplicationProgramming Interface (“API”), may describe the data as well as theformat as follows in Table 2 below:

TABLE 2 M M Val1 Val2 X B 3 4 X A 1 2 Agg. X 4 6 Y A 5 6 Y B 7 8 Agg. Y12 14

Returning to FIG. 2, which is a graphical display of data in accordancewith the principles discussed above, column edge 210 is the horizontalaxis above the pivot table containing one or more layers of informationin the pivot table. Row edge 220 is the vertical axis left of the pivottable containing one or more layers of information in the pivot table.Page edge 230 is the optional pivot filter bar containing zero or morelayers of information for filtering the display of data in the pivottable. Data body 240 contains one or more measures, or data values,displayed in the cells of the pivot table. An edge specifies anaggregation of the original data. For example, in FIG. 2, the originaldata may be in terms of monthly sales figures, but row edge 220specifies a rollup/aggregation into yearly sales figures.

FIG. 2 illustrates a sales pivot table displaying data values for salesin units in data body 240, a geography data layer on column edge 210,and year and product data layers on row edge 220. Page edge 230 is apivot filter bar that filters the sales channel to be displayed between“direct” and “indirect” sales. Row 250 displays the aggregated dataacross years. While ADF is used in this embodiment, it is understoodthat other technologies capable of visually displaying tables may beused.

FIG. 3 is a screenshot 300 of comma separated value (“CSV”) file dataaccording to an embodiment of the present invention. The CSV filecontains columns for year 310, product 320, channel 330, geography 340,sales 350 and units 360. A GUI application, such as one with aninterface similar to the screenshot depicted in FIG. 2, may then parsethese values and apply user-defined settings to display at least some ofthe values in a pivot table. While a CSV file is used here, it isunderstood that other separators than commas and other data storageformats may be used.

When a pivot table, such as the pivot table illustrated in FIG. 2, iscreated, a page definition file may be updated with the requiredbindings. Binding rules specify how to lay out the data during itstransformation, and whether and how to aggregate, sort, or drill throughthe data. A pivot table data map may contain the following elements:

-   -   <columns>: Defines each column item    -   <rows>: Defines each row item in the appropriate sequence    -   <pages>: Defines the items to be included in the pivot filter        bar    -   <aggregatedItems>: Defines the totals and subtotals of items    -   <hierarchies>: Defines the potential drill paths between two        items    -   <sorts>: Defines category sorts and the initial sort order of        pivot table data

Naturally, different element names could be used. An example ExtensibleMarkup Language (“XML”) file containing the bindings may be as followsin some embodiments:

<PivotTable IterBinding=”ptExampleDataIterator” id=”ptExampleData”     xmlns=”http://xmlns.oracle.com/adfm/dvt”     ChangeEventPolicy=”ppr”>  <pivotTableDataMap>   <columns>    <itemvalue=”Geography” itemLabel=”Location”/>    <dataaggregateDuplicates=”true” defaultAggregateType=”SUM”>     <itemvalue=”Sales”/>     <item value=”Units” aggregateType=”AVERAGE”/>   </data>   </columns>   <rows>    <item value=”Year”/>   </rows>  <pages>    <item value=”Channel”/>   </pages>   <aggregatedItems>   <item aggregateLocation=”AFTER” aggregateType=”SUM”     value=”Geography” aggregateLabel=”Total Geography”/>    <itemaggregateLocation=”AFTER” aggregateType=”SUM”      value=”Year”aggregateLabel=”Total Across Years”/>   </aggregatedItems>   <drillstype=”INSERT”/>   <hierarchies>    <item value=”Year” location=”BEFORE”>    <child value=”Product” label=”Product”/>    </item>   </hierarchies>  <sorts>    <categorySort item=”Channel” direction=”DESCENDING”/>   <categorySort item=Year” direction=”ASCENDING”/>    <qdrSliceSortdirection=”DESCENDING” edge=”rows”    grouped=”true”        nullsFirst=”true”>     <item name=”geography” value=”world”/>  </sorts>  </pivotTableDataMap> </pivotTable>

Bindings may be created manually or with the aid of a development tool,such as JDeveloper from Oracle Corp.

FIG. 4 is a flow diagram illustrating a process flow for performing datatable transformation according to an embodiment of the present inventionthat transforms, for example, CSV data of FIG. 3 into the pivot table ofFIG. 2. In some embodiments, the functionality of FIG. 4 is implementedby software stored in memory or other computer readable media, andexecuted by a processor. In other embodiments, the functionality may beperformed by hardware (e.g., through the use of an ASIC, a programmablegate array (“PGA”), a field programmable gate array (“FPGA”), etc.), orany combination of hardware and software.

In some embodiments, the process of FIG. 4 may be performed, forexample, by computer 100 of FIG. 1 via data table transformer 145. Whilethe process flow is shown in a particular order, it is understood thatother orders of execution could occur, such as receiving locations priorto receiving a set of rows. In FIG. 4, the process flow begins with datatable transformer 145 receiving a set of rows at 400 as input data. Eachrow has a set of attributes. Data table transformer 145 then receiveslocations for at least some of the attributes as zero-based edges (suchas the column edge and row edge discussed above with respect to FIG. 2)at 405.

The locations may indicate slowest-to-fastest varying layers within theedge. For example, the slowest-varying layer is the highest level in anedge and would constitute the root of an edge tree. Each level ofchildren below the root is a progressively faster varying layer untilreaching the leaves of the tree (deepest and last values), which wouldbe the fastest varying layer. For instance, “year” may be the root atlevel 0, “month” may be a child of “year” at level 1 and “day” may be aleaf, and child of “month”, at level 2. Zero or more of the remainingattributes may be designated as data values (“facts”) and may appear atthe intersection of the edge attributes from the same row in the inputdata.

Zero-based edges in one embodiment are the enumeration and order of thedata file attributes used by the transformation to organize themulti-dimensional results. Layers relate to the tree depth within eachedge, in that the zeroth (or first) layer is the slowest varying, andthe nth (or last) layer is the fastest varying. For example, for thelayers in the row edge in the results of Table 2 above:

-   -   Attr2->Attr1        Attr2 is the zeroth layer in the row edge, and is the parent of        the Attr1, first layer in the row edge. Attr2 is the slowest        varying layer and Attr1 is the fastest varying layer. In terms        of the values of Attr2 and Attr1, X is a parent to values also        indexed by B and A, as is Y, because there are rows with those        combinations—X & A, X & B, Y & B, etc., in the original data        set. It is possible that Y may only be a parent to B for        example, if there were no row containing both Y & A in the        original data set.

A designation of zero or more of the remaining attributes as “datavalues” (i.e., facts) is received at 410. Per the above, the data valuesultimately appear at the intersection of the edge attributes from thesame row in the input data. Data table transformer 145 then receivesaggregation instructions, including a list of edge attributes and datavalue/aggregation type pairs (such as sum, average, count, and thelike), and optional filters at 415. The optional filters may indicatewhich aggregates should display the constituent edge attributes andwhich should not. Data received by data table transformer 145 may befrom a user, a file, another software application, or any other suitabledata source, and the data may be provided by the same computer orremotely.

Once the above data and specifications have been received, data tabletransformer 145 walks the input data by row at 420. If aggregates werespecified, as in FIG. 4, special “total rows” are created and the datavalues thereof are accumulated according to the aggregation instructionsat 425.

For each edge attribute, data table transformer 145 distributes thevalue to a tree (such as an n-way tree) created for each zero-based edgelocation at 430. An n-way tree is a tree where each node can have up ton children, where n is an integer. For each row, and for each attributewithin that row, if the value is new to that attribute's edge and layer(as specified at 405), then the new value is added at 435 as a child ofthe next slower-varying edge attribute value within the same edge.However, if the value already exists at 430, the value is ignored. Ifmore attribute values or rows remain at 440, the process again proceedsto 430. The tree building process is effectively two loops: one over theoriginal data rows (and previously created aggregate rows, if any) and,within each row, a loop to handle each attribute for which placement wasspecified at 405.

Data values found within each row may be stored using a multiple edgeattribute/value pair hash table. In one embodiment, the hash tableconsists of entries linking keys representing the intersection of theedges' attribute values with the data value to be displayed at thatintersection. In the results of Table 2 above, for example, one of thekey/value pairs (representing the value/intersection for the value “8”in the data body) would be:

-   -   Key: Attr3=″M″, dataVal=″Val2″, Attr2=″Y″, Attr1=″B″ Value: 8

Data table transformer 145 then walks the special total rows at 445 andplaces the edge attribute values thereof within the edge trees eitherbefore or after the constituent edge attributes, depending on designchoice, at 450. Whether constituent edge values are to be shown orhidden is also noted. Data table transformer 145 may either calculatemetrics about the edge trees as the trees are built as shown at 455, orupon request by a consuming software application. The number of childrenof a particular edge attribute, and the total number of data rows orcolumns represented by a particular edge attribute (referred to as“total edge extent”) are some non-limiting examples of potentialmetrics. As an example of total edge extent, in the results of Table 2above, the column edge extent is 2 and the row edge extent is 6 (as theresulting grid of data is 2×6). A GUI software application consuming theresults generated by data table transformer 145 then uses an API that ishighly tuned to the display of multi-dimensional, cross-tabular edgesand data to display the results graphically at 460. Implementing such anAPI enables a developer to make use of the edge trees and edgeattribute/value pair hash tables to return values, metrics about edgesand data cell values to the consuming GUI software application.

In some embodiments, a data table transformer may prepare table data tobe presented in a multi-dimensional, or cross-tabular, format. Trees,such as n-way trees, are generated for each zero-based edge to organizethe data for multi-dimensional display based on a desired visualappearance and functionality. Rows and columns of data have “layers”that can be expanded and collapsed, based on the GUI, to “drill down” toview more detailed layers. Such an implementation may allow a userapplication, rather than a server-side or database application, tochoose which data to present and how the data should be presented to theuser.

As disclosed, data table transformer 145 combines conversion of standardrelational tables into multi-dimensional formats that are easy for viewsto consume, and at the same time optionally calculates and placesaggregates whose children can be displayed or hidden. This provides astraightforward way of rolling up, displaying and analyzing detailedrelational data in a compact, summarized form. In addition, embodimentscan do this for any data in a standard “row set” form consisting ofdefined attributes as columns and data across those columns as rows.This data can be from a data warehouse, a simple comma separated textfile, or a web service feed, for example. This is a powerful capabilityuseful in analyzing sales and financial data, among many otherapplications.

While the term “computer” has been used in the description of someembodiments of the present invention, the invention may be applied tomany types of network computing devices. For purposes of this invention,the term “computer” includes rack computing systems, cloud computingsystems, distributed computing systems, personal computers, laptops,cell phones, personal digital assistants, tablet computing devices,mainframes, any networked devices that perform computing operations, andthe like.

One having ordinary skill in the art will readily understand that theinvention as discussed above may be practiced in a different order,and/or with hardware elements in configurations that are different thanthose that are disclosed. Therefore, although the invention has beendescribed based upon these preferred embodiments, it would be apparentto, and readily appreciated by, those of ordinary skill in the art thatcertain modifications, variations, and alternative constructions wouldbe apparent, while remaining within the spirit and scope of theinvention. In order to determine the metes and bounds of the invention,therefore, reference should be made to the appended claims.

It should be noted that reference throughout this specification tofeatures, advantages, or similar language does not imply that all of thefeatures and advantages that may be realized with the present inventionshould be or are in any single embodiment of the invention. Rather,language referring to the features and advantages is understood to meanthat a specific feature, advantage, or characteristic described inconnection with an embodiment is included in at least one embodiment ofthe present invention. Thus, discussion of the features and advantages,and similar language, throughout this specification may, but do notnecessarily, refer to the same embodiment.

Furthermore, the described features, advantages, and characteristics ofthe invention may be combined in any suitable manner in one or moreembodiments. One skilled in the relevant art will recognize that theinvention may be practiced without one or more of the specific featuresor advantages of a particular embodiment. In other instances, additionalfeatures and advantages may be recognized in certain embodiments thatmay not be present in all embodiments of the invention.

What is claimed is:
 1. A non-transitory computer-readable medium havinginstructions stored thereon that, when executed by a processor, causethe processor to transform input data into pivot table data, thetransforming comprising: receive the input data comprised of attributesas columns and data across the columns as rows, wherein the input datais received in a delimiter-separated value file format; receivelocations for at least some of the attributes as zero-based edges,wherein layers of the edges are presented from the slowest to thefastest varying layers; receive a designation of data values that appearat intersections of edge attributes from the same row; receiveaggregation instructions comprising a list of edge attributes and datavalue/aggregation type pairs; for each of the zero-based edges, createan edge tree; walk the input data by row, and, for each edge attribute,distribute the value of the edge attribute to the edge tree created foreach zero-based edge location; store data for each row in a multipleedge attribute/value pair hash table, the hash table including aplurality of key/data value pairs representing intersections of edgeattribute values with the data value to be displayed at eachintersection, each key including a plurality of edge attribute values;in response to the aggregation instructions, create special total rows;walk the special total rows and place special edge attribute valuesbefore or after the value of the edge attribute on the tree; and displaythe data in a pivot table based on the edge tree and the hash table, thepivot table including a data body having a plurality of data valuecells, a column edge, a row edge and a page edge having a pivot filterbar to filter the data displayed in the pivot table based on data notdisplayed in the pivot table.
 2. The non-transitory computer-readablemedium of claim 1, wherein, when the attribute value is new to the edgeand layer, the attribute value is added as a child of a nextslower-varying edge attribute within the same edge and when theattribute value exists, the attribute value is ignored.
 3. Thenon-transitory computer-readable medium of claim 1, the transformingfurther comprising: accumulate data values according to an aggregatespecification.
 4. The non-transitory computer-readable medium of claim3, the transforming further comprising: receive one or more filtersindicating which aggregates should display constituent edge attributesand which should not.
 5. The non-transitory computer-readable medium ofclaim 1, the transforming further comprising: calculate metrics aboutthe edge trees either as the trees are built or as the metrics arerequested by a consuming Graphical User Interface application.
 6. Thenon-transitory computer-readable medium of claim 5, wherein thecalculates metrics comprise at least one of a total edge extent, anumber of children of a particular edge attribute, a total number ofdata rows represented by a particular edge attribute, or a total numberof data columns represented by a particular data attribute.
 7. Thenon-transitory computer-readable medium of claim 1, wherein theaggregation type includes sum, average or count.
 8. A data tabletransformation system comprising a processor programmed to perform as adata table transformer module configured to: receive the input datacomprised of attributes as columns and data across the columns as rows,wherein the input data is received in a delimiter-separated value fileformat; receive locations for at least some of the attributes aszero-based edges, wherein layers of the edges are presented from theslowest to the fastest varying layers, and receive a designation of datavalues that appear at intersections of edge attributes from the samerow; receive aggregation instructions comprising a list of edgeattributes and data value/aggregation type pairs; for each of thezero-based edges, create an edge tree; walk the input data by row, and,for each edge attribute, distribute the value of the edge attribute tothe edge tree created for each zero-based edge location; store data foreach row in a multiple edge attribute/value pair hash table, the hashtable including a plurality of key/data value pairs representingintersections of edge attribute values with the data value to bedisplayed at each intersection, each key including a plurality of edgeattribute values; in response to the aggregation instructions, createspecial total rows; walk the special total rows and place special edgeattribute values before or after the value of the edge attribute on thetree; and display the data in a pivot table based on the edge tree andthe hash table, the pivot table including a data body having a pluralityof data value cells, a column edge, a row edge and a page edge having apivot filter bar to filter the data displayed in the pivot table basedon data not displayed in the pivot table.
 9. The system of claim 8,wherein, when the attribute value is new to the edge and layer, the treegeneration module is configured to add the attribute value as a child ofa next slower-varying edge attribute within the same edge and when theattribute value exists, the tree generation module is configured toignore the attribute value.
 10. The system of claim 8, wherein the treegeneration module is further configured to accumulate data valuesaccording to an aggregate specification.
 11. The system of claim 8,further comprising: a calculating module configured to calculate metricsabout the edge trees either as the trees are built or as the metrics arerequested by a consuming Graphical User Interface application.
 12. Thesystem of claim 8, the data receiving module further configured toreceive one or more filters indicating which aggregates should displayconstituent edge attributes and which should not.
 13. The system ofclaim 8, wherein the aggregation type includes sum, average or count.14. A computer-implemented method for transforming data tables,comprising: receiving the input data comprised of attributes as columnsand data across the columns as rows, wherein the input data is receivedin a delimiter-separated value file format; receiving locations for atleast some of the attributes as zero-based edges, wherein layers of theedges are presented from the slowest to the fastest varying layers;receiving a designation of data values that appear at intersections ofedge attributes from the same row; receiving aggregation instructionscomprising a list of edge attributes and data value/aggregation typepairs; for each of the zero-based edges, creating an n-way edge tree;walking the input data by row, and, for each edge attribute,distributing the value of the edge attribute to the n-way edge treecreated for each zero-based edge location; storing data for each row ina multiple edge attribute/value pair hash table, the hash tableincluding a plurality of key/data value pairs representing intersectionsof edge attribute values with the data value to be displayed at eachintersection, each key including a plurality of edge attribute values;in response to the aggregation instructions, creating special totalrows; walking the special total rows and placing special edge attributevalues before or after the value of the edge attribute on the tree; anddisplaying the data in a pivot table based on the n-way edge tree andthe hash table, the pivot table including a data body having a pluralityof data value cells, a column edge, a row edge and a page edge having apivot filter bar to filter the data displayed in the pivot table basedon data not displayed in the pivot table.
 15. The computer-implementedmethod of claim 14, wherein, when the attribute value is new to the edgeand layer, the attribute value is added as a child of a nextslower-varying edge attribute within the same edge and when theattribute value exists, the attribute value is ignored.
 16. Thecomputer-implemented method of claim 14, further comprising:accumulating data values according to an aggregate specification. 17.The computer-implemented method of claim 14, further comprising:calculating metrics about the edge trees either as the trees are builtor as the metrics are requested by a consuming Graphical User Interfaceapplication.
 18. The method of claim 14, further comprising receivingone or more filters indicating which aggregates should displayconstituent edge attributes and which should not.
 19. The method ofclaim 14, wherein the aggregation type includes sum, average or count.